On Λ(p) sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some remarks on λp,q-connectedness

A connected graph is λp,q-connected if there is a set of edges whose deletion leaves two components of order at least p and q, respectively. In this paper we present some sufficient conditions for graphs to be λp,q-connected. Furthermore, we study λ2,qconnected graphs in more detail.

متن کامل

Definable Λp-regular cell decomposition

We show that every definable subset of an o-minimal structure expanding an arbitrary real closed field can be decomposed into finitely many definable cells of certain regularity i.e. up to a given order, the derivatives of the functions, defining the cells, have controllable behaviour at the boundary of their domain. In [7] there is a proof of a subanalytic version of Whitney’s extension theore...

متن کامل

Analysis of the Λp Final State Interaction in the Reaction p + p → K + ( Λp )

The missing mass spectrum measured in high resolution studies of the reaction pp → K + X is analyzed with respect to the strong final state interaction near the Λp production threshold. The observed spectrum can be described by factorizing the reaction amplitude in terms of a production amplitude and a final state scattering amplitude. Parametrizing the Λp final state interaction in terms of th...

متن کامل

On invariant sets topology

In this paper, we introduce and study a new topology related to a self mapping on a nonempty set.Let X be a nonempty set and let f be a self mapping on X. Then the set of all invariant subsets ofX related to f, i.e. f := fA X : f(A) Ag P(X) is a topology on X. Among other things,we nd the smallest open sets contains a point x 2 X. Moreover, we find the relations between fand To f . For insta...

متن کامل

On the π-calculus and Co-intuitionistic Logic. Notes on Logic for Concurrency and λP Systems

We reconsider work by Bellin and Scott in the 1990s on R. Milner and S. Abramsky’s encoding of linear logic in the π-calculus and give an account of efforts to establish a tight connection between the structure of proofs and of the cut elimination process in multiplicative linear logic, on one hand, and the input-output behaviour of the processes that represent them, on the other, resulting in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1974

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1974.54.35